Datalog vs. First-Order Logic
نویسندگان
چکیده
Our main result is that every datalog query expressible in rst-order logic is bounded; in terms of classical model theory it is a kind of compactness theorem for nite structures. In addition, we give some counter-examples delimiting the main result.
منابع مشابه
Extensional Higher-Order Datalog
We define a higher-order extension of Datalog based on the Horn fragment of higher-order logic introduced in [Wad91]. Programs of Higher-Order Datalog can be understood declaratively as formulas in extensional higher-order logic, in which (for example) a unary predicate of unary predicates is a set of sets of data objects. The language retains all the basic principles of first-order logic progr...
متن کاملSome Remarks on the Definability of Transitive Closure in First-order Logic and Datalog
In the last WSML phone conference we had a brief discussion about the expressivity of First-order Logic and Datalog resp. the relation between the expressiveness of those two languages. In particular, there has been some confusion around the description of the transitive closure R of some binary relation R. In this short document, we want to clarify the situation and hope to remedy the confusion.
متن کاملModeling Datalog Assertion and Retraction in Linear Logic∗
Practical algorithms have been proposed to efficiently recompute the logical consequences of a Datalog program after a new fact has been asserted or retracted. This is essential in a dynamic setting where facts are frequently added and removed. Yet while assertion is logically well understood as incremental inference, the monotonic nature of first-order logic is ill-suited to model retraction. ...
متن کاملNew methods for computing inferences in first order logic
Recent improvements in satis ability algorithms for propositional logic have made partial instantiation methods for rst order predicate logic computationally more attractive Two such methods have been proposed one by R Jeroslow and a hypergraph method for datalog formulas by G Gallo and G Rago We show that they are instances of two general approaches to partial instantiation and we develop thes...
متن کاملA Summary of the PhD Dissertation Methods for evaluating queries to Horn knowledge bases in first-order logic
Query languages and query processing are important topics in computer science and information technology, as they are widely used in practical applications. Query languages are usually designed so that intensional predicates can be defined by logic rules and query evaluation can be done in polynomial time in the size of the extensional relations. Studying query processing for a query language i...
متن کامل